Implementation of the Convex Edge Segment Grouper
نویسنده
چکیده
Implementation of the Convex Edge Segment Grouper Qingmin Shi Department of Computer Science and Engineering University of South Florida 4202 E. Fowler Avenue, Tampa, FL 33620 Email: [email protected] Abstract| This report describes the implementation of convex line segment grouper proposed by David W. Jacobs[9]. The inputs of this algorithm are line segments obtained by edge detector and straight line nder. De nition of mutually convex lines(MCL) given by Daniel P. Huttenlocher and Peter C. Wayer[10] was adopted. Mathematical expressions of these de nitions will be give. All convex groups satisfying the length-gap ratio and the angle constraints will be found. Keywords| Perceptual grouping, convexity, proximity, non-accidental properties.
منابع مشابه
A Hard Convex Core Yukawa Equation of State for Nonassociated Chain Molecules
The compressibility factor of nonassociated chain molecules composed of hard convex core Yukawa segments was derived with SAFT-VR and an extension of the Barker-Henderson perturbation theory for convex bodies. The temperature-dependent chain and dispersion compressibility factors were derived using the Yukawa potential. The effects of temperature, packing fraction, and segment number on the com...
متن کاملThe convex domination subdivision number of a graph
Let $G=(V,E)$ be a simple graph. A set $Dsubseteq V$ is adominating set of $G$ if every vertex in $Vsetminus D$ has atleast one neighbor in $D$. The distance $d_G(u,v)$ between twovertices $u$ and $v$ is the length of a shortest $(u,v)$-path in$G$. An $(u,v)$-path of length $d_G(u,v)$ is called an$(u,v)$-geodesic. A set $Xsubseteq V$ is convex in $G$ ifvertices from all $(a, b)$-geodesics belon...
متن کاملEuclidean farthest-point Voronoi diagram of a digital edge
A digital edge is a digitization of a straight segment joining two points of integer coordinates. Such a digital set may be analytically defined by the rational slope of the straight segment. We show in this paper that the convex hull, the Euclidean farthest-point Voronoi diagram as well as the dual farthest-point Delaunay triangulation of a digital edge can be fully described by the continued ...
متن کاملDisjoint Segments Have Convex Partitions with 2-Edge Connected Dual Graphs
The empty space around n disjoint line segments in the plane can be partitioned into n+ 1 convex faces by extending the segments in some order. The dual graph of such a partition is the plane graph whose vertices correspond to the n+1 convex faces, and every segment endpoint corresponds to an edge between the two incident faces on opposite sides of the segment. We construct, for every set of n ...
متن کاملSpatial Distribution and Conservation of Speckled Hind and Warsaw Grouper in the Atlantic Ocean off the Southeastern U.S.
There is broad interest in the development of efficient marine protected areas (MPAs) to reduce bycatch and end overfishing of speckled hind (Epinephelus drummondhayi) and warsaw grouper (Hyporthodus nigritus) in the Atlantic Ocean off the southeastern U.S. We assimilated decades of data from many fishery-dependent, fishery-independent, and anecdotal sources to describe the spatial distribution...
متن کامل